A Decentralized Replica Placement Algorithm for Edge Computing
نویسندگان
چکیده
منابع مشابه
P2P Based Decentralized Dynamic Replica Placement Strategy in Grid Environment
A big challenge to the grid computing is the communication on the network. The proper placement for replicas on multiple nodes in P2P or grid environment is an effective way to decrease network cost and improve communication efficiency. The unstable peers, networks, and fluctuant user access mode in the distributed environment make replica placement optimization difficult. We construct a networ...
متن کاملAnalysis Study on Caching and Replica Placement Algorithm for Content Distribution in Distributed Computing Networks
Recently there has been significant research focus on distributed computing network massively caching and replica placement problems for content distribution in globally. Peer-to-Peer (P2P) network provides dynamically decentralized, self organized, scalable objects in distributed computing system. However such networks suffer from high latency, network traffic and cache update problems. The ex...
متن کاملA new Replica Placement Algorithm in Data Grid
Replica placement is one of the important factors to improve performance in data grid systems. A good replica placement algorithm can result in good performance gains. It should be mentioned that, these algorithms or strategies are dependent on architecture of the data grid. By considering different kinds of architecture in data grid systems, a true representation of a grid is a general graph. ...
متن کاملA Framework for Evaluating Replica Placement Algorithms
This paper introduces a framework for evaluating replica placement algorithms (RPA) for content delivery networks (CDN) as well as RPAs from other fields that might be applicable to current or future CDNs. First, the framework classifies and qualitatively compares RPAs using a generic set of primitives that capture problem definitions and heuristics. Second, it provides estimates for the decisi...
متن کاملA SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Network and Service Management
سال: 2018
ISSN: 1932-4537
DOI: 10.1109/tnsm.2017.2788945